package a.f.i;

import a.c.bb;
import a.c.e;
import a.f.o;
import a.f.wc;

import java.awt.geom.Rectangle2D;
import java.util.HashSet;
import java.util.SortedSet;
import java.util.TreeSet;

class d
{
  public SortedSet a(o paramo, bb parambb1, bb parambb2, f.c_ paramc_, a.d.w paramw, boolean paramBoolean)
  {
    boolean bool2 = a.wb;
    boolean bool1 = a.vb;
    TreeSet localTreeSet = new TreeSet(b.i_.k);
    Rectangle2D localRectangle2D1 = wc.a(paramo, parambb2.l());
    Rectangle2D localRectangle2D2 = wc.a(paramo, parambb1.l());
    HashSet localHashSet1 = new HashSet();
    HashSet localHashSet2 = new HashSet();
    double d1 = localRectangle2D2.getMinX() - paramo.k() * localRectangle2D1.getWidth();
    double d2 = localRectangle2D2.getMaxX() + paramo.k() * localRectangle2D1.getWidth();
    double d3 = localRectangle2D2.getMinY() - paramo.k() * localRectangle2D1.getHeight();
    double d4 = localRectangle2D2.getMaxY() + paramo.k() * localRectangle2D1.getHeight();
    int i = 0;
    a.c.w localw1 = parambb2.l();
    label331:
    label372:
    do
    {
      if (!localw1.e()) {
        break;
      }
      e locale1 = localw1.d();
      if (bool1) {
        break label623;
      }
      a.c.w localw2 = parambb1.l();
      do
      {
        do
        {
          if (!localw2.e()) {
            break label523;
          }
          e locale2 = localw2.d();
          double d6 = paramo.n(locale2) - paramo.n(locale1);
          if (bool1) {
            break;
          }
          if (localHashSet1.add(new Double(d6)))
          {
            d7 = localRectangle2D1.getCenterY() + d6;
            if (bool2) {
              break label402;
            }
            if (d7 >= paramc_.e())
            {
              if (bool2) {
                break label402;
              }
              if (d7 <= paramc_.e() + paramc_.c())
              {
                if (!bool2) {
                  if (paramBoolean)
                  {
                    k = (int)Math.abs(paramo.n(locale2) - paramw.b());
                    if (bool2) {
                      break label372;
                    }
                    if (!bool1) {
                      break label331;
                    }
                  }
                }
                int k = (int)a.d.w.a(paramo.o(locale2), paramw);
                i = 1;
                localTreeSet.add(new b.i_(new a.d.w(d1, d7), new a.d.w(d2, d7), k));
              }
            }
          }
          double d7 = paramo.m(locale2) - paramo.m(locale1);
          if (!bool2)
          {
            if (localHashSet2.add(new Double(d7)))
            {
              double d8 = localRectangle2D1.getCenterX() + d7;
              if (bool2) {
                continue;
              }
              if (d8 >= paramc_.d())
              {
                if (bool2) {
                  continue;
                }
                if (d8 <= paramc_.d() + paramc_.b())
                {
                  int m = (int)a.d.w.a(paramo.o(locale2), paramw);
                  localTreeSet.add(new b.i_(new a.d.w(d8, d3), new a.d.w(d8, d4), m));
                }
              }
            }
            localw2.f();
          }
        } while (!bool1);
        localw1.f();
      } while (bool2);
    } while (!bool1);
    label402:
    if ((!bool2) && ((bool2) || ((i == 0) && (paramBoolean))))
    {
      double d5 = paramc_.g().b();
      int j = (int)Math.abs(d5 - paramw.b());
      localTreeSet.add(new b.i_(new a.d.w(d1, d5), new a.d.w(d2, d5), j));
    }
    label523:
    label623:
    return localTreeSet;
  }
}



/* Location:           E:\idea\

 * Qualified Name:     a.f.i.d

 * JD-Core Version:    0.7.0.1

 */